Ultimate Polynomial Time
نویسنده
چکیده
The class UP of ‘ultimate polynomial time’ problems over C is introduced; it contains the class P of polynomial time problems over C. The τ -Conjecture for polynomials implies that UP does not contain the class of non-deterministic polynomial time problems definable without constants over C. This latest statement implies that P 6 = NP over C. A notion of ‘ultimate complexity’ of a problem is suggested. It provides lower bounds for the complexity of structured problems.
منابع مشابه
Results on Independent Sets in Categorical Products of Graphs, the Ultimate Categorical Independence Ratio and the Ultimate Categorical Independent Domination Ratio
We show that there are polynomial-time algorithms to compute maximum independent sets in the categorical products of two cographs and two splitgraphs. The ultimate categorical independence ratio of a graph G is defined as limk→∞ α(G )/n. The ultimate categorical independence ratio is polynomial for cographs, permutation graphs, interval graphs, graphs of bounded treewidth and splitgraphs. When ...
متن کاملUltimate Positivity is Decidable for Simple Linear Recurrence Sequences
We consider the decidability and complexity of the Ultimate Positivity Problem, which asks whether all but finitely many terms of a given rational linear recurrence sequence (LRS) are positive. Using lower bounds in Diophantine approximation concerning sums of S-units, we show that for simple LRS (those whose characteristic polynomial has no repeated roots) the Ultimate Positivity Problem is de...
متن کاملEffective Positivity Problems for Simple Linear Recurrence Sequences
We consider two computational problems for linear recurrence sequences (LRS) over the integers, namely the Positivity Problem (determine whether all terms of a given LRS are positive) and the effective Ultimate Positivity Problem (determine whether all but finitely many terms of a given LRS are positive, and if so, compute an index threshold beyond which all terms are positive). We show that, f...
متن کاملIndependent set in categorical products of cographs and splitgraphs
We show that there are polynomial-time algorithms to compute maximum independent sets in the categorical products of two cographs and two splitgraphs. We show that the ultimate categorical independence ratio is computable in polynomial time for cographs.
متن کاملA Polynomial-Time-Delay and Polynomial-Space Algorithm for Enumeration Problems in Multi-criteria Optimization
We propose a polynomial-time-delay polynomial-space algorithm to enumerate all efficient extreme solutions of a multi-criteria minimum-cost spanning tree problem, while only the bicriteria case was studied in the literature. The algorithm is based on the reverse search framework due to Avis & Fukuda. We also show that the same technique can be applied to the multi-criteria version of the minimu...
متن کامل